#include <iostream>
#include <cstring>
#include <cstdio>
#include <vector>
#include <queue>
const int MAXN = 2007;
using namespace std;
vector<int> M[MAXN];
bool visited[MAXN];
bool res[MAXN];
bool check(int p) {
    visited[p] = true;
    queue<int> q;
    q.push(p);
    while (!q.empty()) {
        int pre = q.front(); q.pop();
        int len = M[pre].size();
        for (int i=0; i<len; ++i) {
            int nex = M[pre][i];
            if (!visited[nex]) {
                q.push(nex);
                visited[nex] = true;
                res[nex] = !res[pre];
            }
            else {
                if (res[nex] == res[pre]) return false;
            }
        }
    }
    return true;
}
bool ANS(int n) {
    memset(visited, false, sizeof(bool)*(n+7));
    for (int i=1; i<=n; ++i) {
        if (!visited[i]) {
            res[i] = 1;
            if (!check(i)) return false;
        }
    }
    return true;
}
int main(int argc, char** argv) {
    int t;
    cin>>t;
    for (int i=1; i<=t; ++i) {
        int n,m;
        int s,e;
        cin>>n>>m;
        for (int j=1; j<=n; ++j) M[j].clear();
        for (int j=0; j<m; ++j) {
            scanf("%d %d", &s, &e);
            M[s].push_back(e);
            M[e].push_back(s);
        }
        if (!ANS(n)) {
            printf("Scenario #%d:\nSuspicious bugs found!\n\n", i);
        }
        else {
            printf("Scenario #%d:\nNo suspicious bugs found!\n\n", i);
        }
    }
    return 0;
}
